A hybrid modeling approach for the optimal scheduling of two symmetric queues with finite capacity and setup times
نویسندگان
چکیده
In this paper we study optimal transient scheduling for an unflexible, two part-type, symmetric manufacturing system characterized by non negligible setup times and finite buffer capacities. The solution method relies on the exploitation of necessary conditions of optimality of the control policies to introduce a sampled version of the original system dynamics. By means of such a sampled model we derive the analytical solution of the addressed problem, which shows a simple feedback structure. Index Terms Manufacturing Systems, Scheduling, Switched Systems, Setup Times, Finite Buffers.
منابع مشابه
Dipartimento di Ingegneria Elettronica e dell ’ Informazione RT 002 - 04 Optimal control of two symmetric competing queues with finite capacity and non negligible setup
In this paper we study optimal scheduling for a two part-type, symmetric manufacturing systems subject to non negligible setup times, and characterized by finite buffer capacity. The solution method relies on 1) restricting the possible control policies to those which respect some general necessary conditions of optimality, and on 2) the exploitation of such properties to introduce a two-dimens...
متن کاملOptimum Aggregate Inventory for Scheduling Multi-product Single Machine System with Zero Setup Time
In this paper we adopt the common cycle approach to economic lot scheduling problem and minimize the maximum aggregate inventory. We allow the occurrence of the idle times between any two consecutive products and consider limited capital for investment in inventory. We assume the setup times are negligible. To achieve the optimal investment in inventory we first find the idle times which minimi...
متن کاملA New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
This paper presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...
متن کاملA novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem
Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...
متن کاملFinite Horizon Economic Lot and Delivery Scheduling Problem: Flexible Flow Lines with Unrelated Parallel Machines and Sequence Dependent Setups
This paper considers the economic lot and delivery scheduling problem in a two-echelon supply chains, where a single supplier produces multiple components on a flexible flow line (FFL) and delivers them directly to an assembly facility (AF). The objective is to determine a cyclic schedule that minimizes the sum of transportation, setup and inventory holding costs per unit time without shortage....
متن کامل